Performance Evaluation of Resource Reservation Policies for Rate-Controlled Eealiest-Deadline-First Scheduling in ATM Networks*

The paper addresses the issue of reserving resources at ATM switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing cells using the Rate Controlled EarliestDeadline-First (EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline when providing delay bounds to a number of calls being served by a single scheduler. We propose a number of static and dynamic reservation policies for mapping the end-to-end delay requirement of a call into local delay deadlines to be reserved at each scheduler. These policies are based on non-even resource reservation based on the capacities and loading at each node in the network. We also present results of various simulation models used for evaluating the performance of proposed policies.